Molecules as Automata

نویسنده

  • Luca Cardelli
چکیده

Molecular biology investigates the structure and function of biochemical systems starting from their basic building blocks: macromolecules. A macromolecule is a large, complex molecule (a protein or a nucleic acid) that usually has inner mutable state and external activity. Informal explanations of biochemical events trace individual macromolecules through their state changes and their interaction histories: a macromolecule is endowed with an identity that is retained through its transformations, even through changes in molecular energy and mass. A macromolecule, therefore, is qualitatively different from the small molecules of inorganic chemistry. Such molecules are stateless: in the standard notation for chemical reactions they are seemingly created and destroyed, and their atomic structure is used mainly for the bookkeeping required by the conservation of mass. Attributing identity and state transitions to molecules provides more than just a different way of looking at a chemical event: it solves a fundamental difficulty with chemical-style descriptions. Each macromolecule can have a huge number of internal states, exponentially with respect to its size, and can join with other macromolecules to from even larger state configurations, corresponding to the product of their states. If each molecular state is to be represented as a stateless chemical species, transformed by chemical reactions, then we have a huge explosion in the number of species and reactions with respect to the number of different macromolecules that actually, physically, exist. Moreover, macromolecules can join to each other indefinitely, resulting in situations corresponding to infinite sets of chemical reactions among infinite sets of different chemical species. In contrast, the description of a biochemical system at the level of macromolecular states and transitions remains finite: the unbounded complexity of the system is implicit in the potential molecular interactions, but does not have to be written down explicitly. Molecular biology textbooks widely adopt this finite description style, at least for the purpose of illustration. Many proposal now exist that aim to formalize the combinatorial complexity of biological systems without a corresponding explosion in the notation. Macromolecules, in particular, are seen as stateful concurrent agents that interact with each other through a dynamic interface. While this style of descriptions is (like many others) not quite accurate at the atomic level, it forms the basis of a formalized and growing body of biological knowledge. The complex chemical structure of a macromolecule is thus commonly abstracted into just internal states and potential interactions with the environment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media

Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...

متن کامل

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

متن کامل

Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

متن کامل

Quantum Dot Molecules for Quantum Cellular Automata: Future Quantum Computer

Ordered quantum dot molecules are grown by a modified MBE growth using thin-capping and regrowth processes. This technique yields QDs which are uniform and aligned along [11̄0] directions. This paper presents an attempt to group 4-5 dots per each quantum dot molecule, in order to form a physical structure that can function as quantum cellular automata, giving rise to the possibility of developin...

متن کامل

Exploring regular reversibility in Watson-Crick finite automata

Watson-Crick finite automata were inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of regular reversibility in this model. Mainly, we will explore regular reversibility in the upper (lower) strand and in the double strand.

متن کامل

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008